Towards Quantum One-Time Memories from Stateless Hardware

A central tenet of theoretical cryptography is the study minimal assumptions required to implement a given cryptographic primitive. One such primitive one-time memory (OTM), introduced by Goldwasser, Kalai, and Rothblum [CRYPTO 2008], which classical functionality modeled after non-interactive 1-out-of-2 oblivious transfer, complete for quantum programs. It known that secure OTMs do not exist in standard model both settings. Here, we propose scheme using information, together with assumption stateless (i.e., reusable) hardware tokens, build statistically OTMs. Via semidefinite programming-based games framework Gutoski Watrous [STOC 2007], prove security malicious receiver making at most 0.114n adaptive queries token (for <mml:math key size), universal composability framework, but leave open question against polynomial amount queries. Compared alternative schemes derived from literature on money, our technologically simple since it "prepare-and-measure" type. We also give two impossibility results showing certain cannot be relaxed.